-
1 меченые графы
Makarov: labeled graphs -
2 представление молекул на основе их рисунка в виде меченых графов
Универсальный русско-английский словарь > представление молекул на основе их рисунка в виде меченых графов
-
3 неэквивалентные меченные знаками графы
Makarov: inequivalent labeled signed graphsУниверсальный русско-английский словарь > неэквивалентные меченные знаками графы
См. также в других словарях:
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Clique-width — In graph theory, the clique width of a graph G is the minimum number of labels needed to construct G by means of the following 4 operations : Creation of a new vertex v with label i ( noted i(v) ) Disjoint union of two labeled graphs G and H … Wikipedia
Conceptual graph — Conceptual graphs (CGs) are a formalism for knowledge representation. In the first published paper on CGs, John F. Sowa (Sowa 1976) used them to represent the conceptual schemas used in database systems. The first book on CGs (Sowa 1984) applied… … Wikipedia
ADE classification — The simply laced Dynkin diagrams classify diverse mathematical objects. In mathematics, the ADE classification (originally A D E classifications) is the complete list of simply laced Dynkin diagrams or other mathematical objects satisfying… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Поиск количественных соотношений структура-свойство — Поиск количественных соотношений структура свойство процедура построения моделей, позволяющих по структурам химических соединений предсказывать их разнообразные свойства. За моделями, позволяющими прогнозировать количественные… … Википедия
QSAR — Поиск количественных соотношений структура свойство процедура построения моделей, позволяющих по структурам химических соединений предсказывать их разнообразные свойства. За моделями, позволяющими прогнозировать количественные… … Википедия
Molecule mining — This page describes mining for molecules. Since molecules may be represented by molecular graphs this is strongly related to graph mining and structured data mining. The main problem is how to represent molecules while discriminating the data… … Wikipedia
XML Protocol — The XML Protocol ( XMLP ) is a standard being developed by the W3C XML Protocol Working Group to the following guidelines, outlined in the group s charter:# An envelope for encapsulating XML data to be transferred in an interoperable manner that… … Wikipedia
Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal … Wikipedia